Inventory routing problems with multiple customers

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Perishable Inventory Model with Retrial Demands, Negative Customers and Multiple Working Vacations

This paper presents the analysis of a continuous review perishable inventory system wherein the life time of each item follows an exponential distribution. The operating policy is (s,S) policy where the ordered items are received after a random time which follows exponential distribution. Primary arrival follows Poisson distribution and they may turnout to be posit...

متن کامل

Allocating Cost of Service to Customers in Inventory Routing

Vendor managed inventory (VMI) replenishment is a collaboration between a supplier and its customers where the supplier is responsible for managing the customers’ inventory levels. In the VMI setting we consider, the supplier exploits synergies between customers, e.g., their locations, usage rates, and storage capacities, to reduce distribution costs. Due to the intricate interactions between c...

متن کامل

Inventory Routing Problems : a multiobjective approach

Logistic activities, from a certain point of view, are often structured around two concepts, the transportation of goods and the management of the same goods. Of course, these two activities are highly interlinked. It is possible to combine at the same time the problem of defining the amount of goods that have to be shipped (the Inventory Management problem – the quantity decision) and the rout...

متن کامل

Decomposing Inventory Routing Problems with Approximate Value Functions

We present a time decomposition for inventory routing problems. The methodology is based on valuing inventory with a concave piecewise linear function and then combining solutions to single-period subproblems using dynamic programming techniques. Computational experiments show that the resulting value function accurately captures the inventory’s value, and solving the multi-period problem as a ...

متن کامل

Approximation Algorithms for Inventory Problems with Submodular or Routing Costs

We consider the following two deterministic inventory optimization problems over a finite planning horizon T with non-stationary demands. • Submodular Joint Replenishment Problem. This involves multiple item types and a single retailer who faces demands. In each time step, any subset of item-types can be ordered incurring a joint ordering cost which is submodular. Moreover, items can be held in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: EURO Journal on Transportation and Logistics

سال: 2013

ISSN: 2192-4376,2192-4384

DOI: 10.1007/s13676-013-0027-z